Edge-pancyclicity of coupled graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge-pancyclicity of coupled graphs

The coupled graph c(G) of a plane graph G is the graph de.ned on the vertex set V (G)∪F(G) so that two vertices in c(G) are joined by an edge if and only if they are adjacent or incident in G. We prove that the coupled graph of a 2-connected plane graph is edge-pancyclic. However, there exists a 2-edge-connected plane graph G such that c(G) is not Hamiltonian. ? 2002 Elsevier Science B.V. All r...

متن کامل

Node-pancyclicity and edge-pancyclicity of hypercube variants

Twisted cubes, crossed cubes, Möbius cubes, and locally twisted cubes are some of the widely studied hypercube variants. The 4-pancyclicity of twisted cubes, crossed cubes, Möbius cubes, locally twisted cubes and the 4-edgepancyclicity of crossed cubes are proven in [2, 1, 5, 10, 6] respectively. It should be noted that 4-edge-pancyclicity implies 4-node-pancyclicity which further implies 4-pan...

متن کامل

Edge-pancyclicity of Möbius cubes

The Möbius cube Mn is a variant of the hypercube Qn and has better properties than Qn with the same number of links and processors. It has been shown by Fan [J. Fan, Hamilton-connectivity and cycle-embedding of Möbius cubes, Inform. Process. Lett. 82 (2002) 113–117] and Huang et al. [W.-T. Huang, W.-K. Chen, C.-H. Chen, Pancyclicity of Möbius cubes, in: Proc. 9th Internat. Conf. on Parallel and...

متن کامل

Pancyclicity of recursive circulant graphs

In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic and bipancyclic.  2002 Elsevier Science B.V. All rights reserved.

متن کامل

Pancyclicity of hamiltonian line graphs

Let f(n) be the smallest integer such that for every graph G of order n with minimum degree 3(G)>f(n), the line graph L(G) of G is pancyclic whenever L(G) is hamiltonian. Results are proved showing that f(n) = ®(n 1/3).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2002

ISSN: 0166-218X

DOI: 10.1016/s0166-218x(01)00307-9